A Flexible Scheduling Framework Supporting Multiple Programming Models with Arbitrary Semantics in Linux∗
نویسندگان
چکیده
We present a hierarchic scheduling framework for Linux called Group Scheduling that facilitates the creation of arbitrary thread schedulers. Traditional approaches to developing new scheduling semantics require semantic mappings onto existing schedulers, such as static-priority. Group Scheduling allows for a direct implementation of semantics, allowing clear mappings at any level a developer desires. In order to effectively support scheduling semantics, integration with concurrency control is necessary (e.g. priority inheritance). However, when considering arbitrary scheduling semantics hard-wired solutions such as PI can’t adapt. We present Proxy Execution as a general mechanism to resolving policy conflicts that arise as tasks from different scheduling domains interact through the RT-Mutex primitive.
منابع مشابه
Exact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment
This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...
متن کاملFlexible Scheduling of Active Distribution Networks for Market Participation with Considering DGs Availability
The availability of sufficient and economic online capacity to support the network while encountering disturbances and failures leading to supply and demand imbalance has a crucial role in today distribution networks with high share of Distributed Energy Resources (DERs), especially Renewable Energy Resources (RESs). This paper proposes a two-stage decision making framework for the Distribution...
متن کاملLevel Mapping Characterizations of Selector Generated Models for Logic Programs
Assigning semantics to logic programs via selector generated models (Schwarz 2002/2003) extends several semantics, like the stable, the inflationary, and the stable generated semantics, to programs with arbitrary formulae in rule heads and bodies. We study this approach by means of a unifying framework for characterizing different logic programming semantics using level mappings (Hitzler and We...
متن کاملNew scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کامل